Adding recursive constructs to bialgebraic semantics
نویسندگان
چکیده
منابع مشابه
Bialgebraic Semantics and Recursion
In [9] a unifying framework was given for operational and denotational semantics. It uses bialgebras, which are combinations of algebras (used for syntax and denotational semantics) and coalgebras (used for operational semantics and solutions to domain equations). Here we report progress on the problem of adapting that framework to include recursion. A number of difficulties were encountered. A...
متن کاملFrom Bialgebraic Semantics to Congruence Formats
A general and abstract framework to defining congruence formats for various process equivalences is presented. The framework extends bialgebraic techniques of Turi and Plotkin with an abstract coalgebraic approach to process equivalence, based on a notion of test suite. The resulting technique is illustrated on the example of completed trace equivalence. Rather than providing formal proofs, the...
متن کاملStructural congruence for bialgebraic semantics
It was observed by Turi and Plotkin that structural operational semantics can be studied at the level of universal coalgebra, providing specification formats for well-behaved operations on many different types of systems. We extend this framework with non-structural assignment rules which can express, for example, the syntactic format for structural congruences proposed by Mousavi and Reniers. ...
متن کاملBialgebraic Semantics for Logic Programming
Bialgebrae provide an abstract framework encompassing the semantics of different kinds of computational models. In this paper we propose a bialgebraic approach to the semantics of logic programming. Our methodology is to study logic programs as reactive systems and exploit abstract techniques developed in that setting. First we use saturation to model the operational semantics of logic programs...
متن کاملCombining Bialgebraic Semantics and Equations
It was observed by Turi and Plotkin that structural operational semantics can be studied at the level of universal coalgebra, providing specification formats for well-behaved operations on many different types of systems. We extend this framework with non-structural assignment rules which can express, for example, the syntactic format for structural congruences proposed by Mousavi and Reniers. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic and Algebraic Programming
سال: 2004
ISSN: 1567-8326
DOI: 10.1016/j.jlap.2004.03.005